When does a heap become a heap?

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Where does a cohesive granular heap break?

In this paper, we consider the effect of cohesion on the stability of a granular heap and compute the maximum angle of stability of the heap as a function of the cohesion. We show that the stability is strongly affected by the dependence of the cohesion on the local pressure. In particular, this dependence is found to determine the localization of the failure plane. While for a constant adhesio...

متن کامل

The Violation Heap: A Relaxed Fibonacci-Like Heap

We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case time, insert, meld and decrease-key require O(1) amortized time, and delete-min requires O(log n) amortized time. Our structure is simple and promises an efficient practical behavior when compared to other known Fibonacci-like heaps. The main idea behind our constructio...

متن کامل

A Selectable Sloppy Heap

We study the selection problem, namely that of computing the ith order statistic of n given elements. Here we offer a data structure called selectable sloppy heap handling a dynamic version in which upon request: (i) a new element is inserted or (ii) an element of a prescribed quantile group is deleted from the data structure. Each operation is executed in (ideal!) constant time— and is thus in...

متن کامل

A New Heap Game

Given k ≥ 3 heaps of tokens. The moves of the 2-player game introduced here are to either take a positive number of tokens from at most k − 1 heaps, or to remove the same positive number of tokens from all the k heaps. We analyse this extension of Wythoff’s game and provide a polynomial-time strategy for it.

متن کامل

A Distributed and Oblivious Heap

This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends on the nodes currently in the network but not on the past. This allows for fast join and leave operations which is desirable in open distributed systems with high levels of churn and frequent faults. In fact, a node ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Multiple Sclerosis Journal

سال: 2021

ISSN: 1352-4585,1477-0970

DOI: 10.1177/1352458520988459